課程名稱 |
資料結構 Data Structures |
開課學期 |
106-1 |
授課對象 |
管理學院 資訊管理學系 |
授課教師 |
蔡益坤 |
課號 |
IM2007 |
課程識別碼 |
705 21200 |
班次 |
|
學分 |
3.0 |
全/半年 |
半年 |
必/選修 |
必帶 |
上課時間 |
星期一7,8,9(14:20~17:20) |
上課地點 |
管一103 |
備註 |
本課程中文授課,使用英文教科書。部分週次之週一6有實習課,地點同上課教室。 總人數上限:70人 外系人數限制:10人 |
Ceiba 課程網頁 |
http://ceiba.ntu.edu.tw/1061ds2017 |
課程簡介影片 |
|
核心能力關聯 |
本課程尚未建立核心能力關連 |
課程大綱
|
為確保您我的權利,請尊重智慧財產權及不得非法影印
|
課程概述 |
This is an introductory course on data structures, concerning the various ways of organizing data so that the data can be accessed and manipulated efficiently by an application. A central concept is that of an abstract data type, which is a collection of data and a set of operations on the data. The course therefore focuses on the fundamental concepts, techniques, and tools for the design and implementation of abstract data types, following the teaching of object-oriented design and programming for computer problem solving. The course will cover most of the main textbook in essentially the same order, plus supplementary readings. |
課程目標 |
This course introduces to the students the fundamental concept of an abstract data type. Its goal is to acquaint the students with the design principles and applications of several commonly used abstract data types such as stacks, priority queues, and binary search trees and, through close examination, the data structures and their manipulations that underly the implementations of these abstract data types. |
課程要求 |
Some first course of computer programming
|
預期每週課後學習時數 |
|
Office Hours |
|
指定閱讀 |
F.M. Carrano and T. Henry, “Data Abstraction and Problem Solving with C++: Walls and Mirrors,” 6th Edition, Pearson, 2013 (International Edition).
|
參考書目 |
待補 |
評量方式 (僅供參考) |
|
週次 |
日期 |
單元主題 |
Week 1 |
09/11 |
Introduction and Data Abstraction |
Week 2 |
09/18 |
Recursion |
Week 3 |
09/25 |
Array-Based Implementations |
Week 4 |
09/30 |
Link-Based Implementations |
Week 5 |
10/02 |
Stacks: The ADT and Its Uses |
Week 6 |
10/16 |
Stack Implementations and Lists |
Week 7 |
10/23 |
Algroithm Efficiency and Sorting |
Week 8 |
10/30 |
Queues |
Week 9 |
11/06 |
Midterm |
Week 10 |
11/13 |
Trees |
Week 11 |
11/20 |
Trees |
Week 12 |
11/27 |
Heaps |
Week 13 |
12/04 |
Hashing |
Week 14 |
12/11 |
Balanced Search Trees |
Week 15 |
12/18 |
Balanced Search Trees |
Week 16 |
12/25 |
Graphs |
Week 17 |
01/01 |
National Holiday |
Week 18 |
01/08 |
Final |
|